-
1 Cartesian tree
Математика: декартово дерево -
2 Cartesian tree
декартово дерево, дерево поиска с приоритетом -
3 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
4 cartesian space
English-Russian big polytechnic dictionary > cartesian space
-
5 system
1) система; комплекс2) совокупность•- absolutely consistent system - absolutely direct indecomposable system - absolutely free system - absolutely irreducible system - absolutely isolated system - allowable coordinate system - almost linear system - ample linear system - artificial feel system - automatic block system - automatic deicing system - binary relational system - binary-coded decimal system - block tooling system - Cartesian coordinate system - completely controllable system - completely ergodic system - completely hyperbolic system - completely identifiable system - completely integrable system - completely irreducible system - completely regular system - completely stable system - completely stratified system - complex number system - conical coordinate system - derivational formal system - differential equation system - differential selsyn system - digital counting system - digital transmission system - elliptic coordinate system - elliptic cylindrical coordinate system - externally inconsistent system - finite state system - finitely axiomatizable system - finitely presented system - fully characteristic quotient system - fundamental system of solutions - hydraulic lift system - integrated switching system - isomorphically embedded system - kernel normal system - linearly dependent system - linearly independent system - live hydraulic system - locking protection system - meteor-burst communication system - modular programming system - parabolic cylindrical coordinate system - permanent four-wheel drive system - pure independent system - radio telephone system - reactor protection system - real number system - receiver-amplifier crioelectric system - remote-cylinder hydraulic system - semantically consistent system - simply consistent system - simply incomplete system - simply ordered system - spherical coordinate system - strongly multiplicative system - structurally stable system - sufficiently general coordinate system - system of frequency curves - system of rational numbers - time multiplex system - time-division multiplex system - uniformly complete system - univalent system of notation - universal system of notation - weakly closed system - weighted number system
См. также в других словарях:
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree (descriptive set theory) — In descriptive set theory, a tree on a set X is a set of finite sequences of elements of X that is closed under subsequences. More formally, it is a subset T of X^{ … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Hash tree — A binary hash tree In cryptography and computer science Hash trees or Merkle trees are a type of data structure[citation needed] which contains a tree of summary information about a larger piece of da … Wikipedia
Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… … Wikipedia
Dancing tree — For the film Dancing tree, see Dancing tree (film) In computer science, a dancing tree is a tree data structure, which is similar to B+ tree. Invented by Hans Reiser, for use by the Reiser4 file system. As opposed to self balancing binary search… … Wikipedia
Metric tree — This article is about the data structure. For the type of metric space, see Real tree. A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle… … Wikipedia
Cover tree — The cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed up of a nearest neighbor search. It is a refinement of the Navigating Net data structure, and related to a variety of other data… … Wikipedia
Doubly chained tree — In computer science, a Doubly chained tree is a tree data structure in which each node has two pointers. Typically, each node has one pointer pointing to its child and one pointing at the node to its right. Then the following node will have one… … Wikipedia
Randomized binary search tree — A randomized binary search tree (abbreviated RBST, also known as Cartesian tree) is a type of binary search tree, with data nodes organizedas in a normal binary search tree. Each node has also an access priority, namely p(n) which is chosen in a… … Wikipedia
Recursive tree — In graph theory, a discipline within mathematics, a recursive tree is a non planar labeled rooted tree. A size n recursive tree is labeled by distinct integers 1, 2, ..., n , where the labels are strictly increasing starting at the root labeled 1 … Wikipedia